Observations on Coset Enumeration
نویسنده
چکیده
Todd and Coxeter's method for enumerating cosets of nitely generated subgroups in nitely presented groups (abbreviated by Tc here) is one famous method from combinatorial group theory for studying the subgroup problem. Since preex string rewriting is also an appropriate method to study this problem, preex string rewriting methods have been compared to Tc. We recall and compare two of them brieey, one by Kuhn and Madlener 4] and one by Sims 15]. A new approach using preex string rewriting in free groups is derived from the algebraic method presented by Reinert, Mora and Madlener in 14] which directly emulates Tc. It is extended to free monoids and an algebraic characterization for the \cosets" enumerated in this setting is provided. rewriting, Grr obner bases in monoid and group rings.
منابع مشابه
Proving a Group Trivial Made Easy: a Case Study in Coset Enumeration
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating nitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. We show that the problems ar...
متن کاملOn doing Todd-Coxeter enumeration in parallel*
Akl, S., G. Laborite, M. Leeder and K. Qiu, On doing Todd-Coxeter coset enumeration in parallel, Discrete Applied Mathematics 34 (1991) 27-35. The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports ...
متن کاملCoset Enumeration of Symmetrically Generated Groups Using Gröbner Bases
A new method for coset enumeration in symmetrically generated groups is presented. This method is based on a Gröbner bases algorithm applied to polynomials in non-commuting variables with integer coefficients. Mathematics Subject Classification: 05A05; 20B05; 20B40
متن کاملParallel Coset Enumeration Using Threads
Coset enumeration is one of the basic tools for investigating nitely presented groups. Many enumerations require signiicant resources, in terms of CPU time or memory space. We develop a fully functional parallel coset enumeration procedure and we discuss some of the issues involved in such parallelisation using the POSIX threads library. Our results can equally well be applied to any master-sla...
متن کاملDouble-coset enumeration algorithm for symmetrically generated groups
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998